Cofinalities of countable ultraproducts: the existence theorem.
نویسندگان
چکیده
منابع مشابه
Ultraproducts, the Compactness Theorem and Applications
This is a set of lecture notes used in a course on model theory at Virginia Commonwealth University (Math 591 Topics: Logic and Mathematical Structures), which I taught jointly with Sean Cox in the spring of 2014. Most of the material contained in these notes can be found in the following sources. References: • Chang and Keisler. Model Theory, Studies in Logic and the Foundations of Mathematics...
متن کاملOn the countable generator theorem
Let T be a finite entropy, aperiodic automorphism of a nonatomic probability space. We give an elementary proof of the existence of a finite entropy, countable generating partition for T . In this short article we give a simple proof of Rokhlin’s countable generator theorem [Ro], originating from considerations in [Se] which use standard techniques in ergodic theory. We hope that these consider...
متن کاملKiddie Talk: Ultraproducts and Szeméredi’s Theorem
As promised, this talk will not assume any knowledge of ultrafilters, ultraproducts, or any model theory. The plan is as follows: (1) Ultrafilters (2) Ultraproducts (3) Joke (4) What are ultraproducts good for? (5) Szeméredi’s theorem via ultraproducts References: Mostly Terence Tao’s various blog notes on ultraproducts. For model theory, see David Marker’s Model Theory: An Introduction for a v...
متن کاملMenger's theorem for countable graphs
For a finite graph G= (I’, E) Menger’s Theorem [6] states the following: if A, B c V then the minimal size of an A -B separating set of vertices (i.e., a set whose removal disconnects A from B), equals the maximal size of a set of disjoint A -B paths. This version of the theorem remains true, and quite easy to prove, also in the infinite case. To see this, take 9 to be a maximal (with respect t...
متن کاملCountable Sets and Hessenberg’s Theorem
The papers [20], [16], [3], [11], [9], [15], [5], [8], [7], [21], [19], [2], [1], [10], [22], [12], [13], [18], [14], [17], [4], and [6] provide the terminology and notation for this paper. For simplicity we follow the rules: X, Y are sets, D is a non-empty set, m, n, n1, n2, n3, m2, m1 are natural numbers, A, B are ordinal numbers, L, K, M , N are cardinal numbers, x is arbitrary, and f is a f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1989
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093635237